Computer and Modernization ›› 2012, Vol. 203 ›› Issue (7): 55-57.doi: 10.3969/j.issn.1006-2475.2012.07.015
• 算法设计与分析 • Previous Articles Next Articles
ZHOU Hua-jun, DING Ai-fen, MA Rui-ying
Received:
Revised:
Online:
Published:
Abstract: This article discusses the longest common subsequence algorithm used on scoring of filling in blanks, and designs a common recognition logic of filling in the blanks based on net examination system. Its operation is feasible in independent academy net examination system.
Key words: longest common subsequence algorithm, filling in blanks, scoring, net examination system
CLC Number:
TP301.6
ZHOU Hua-jun;DING Ai-fen;MA Rui-ying. Application of Longest Common Subsequence Algorithm on Scoring of Filling in Blanks[J]. Computer and Modernization, 2012, 203(7): 55-57.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.c-a-m.org.cn/EN/10.3969/j.issn.1006-2475.2012.07.015
http://www.c-a-m.org.cn/EN/Y2012/V203/I7/55